---------------------------------------------------------------
-> printing queue1 -> empty, total 0 elements
-> printing queue2 -> empty, total 0 elements
-> printing queue3 -> empty, total 0 elements
-> printing queue4 -> empty, total 0 elements
---------------------------------------------------------------
---------------------------------------------------------------
-> printing queue2, after one put, total 1 elements
 > node tid =   0, ready time =  40
-> printing first element of list queue2 after 6 puts
 > node tid =   0, ready time= 40

-> printing queue2 after 6 puts, total 6 elements
 > node tid =   0, ready time =  40
 > node tid =   1, ready time =  20
 > node tid =   2, ready time =  30
 > node tid =   3, ready time =  35
 > node tid =   4, ready time =  50
 > node tid =   5, ready time =  10
---------------------------------------------------------------
---------------------------------------------------------------
-> printing queue3 -> empty, total 0 elements
-> printing first element of list --->> queue2, for-loop before pop
 > node tid =   0, ready time= 40

-> printing queue2, for-loop after pop, total 5 elements
 > node tid =   1, ready time =  20
 > node tid =   2, ready time =  30
 > node tid =   3, ready time =  35
 > node tid =   4, ready time =  50
 > node tid =   5, ready time =  10
-> printing queue3, for-loop, total 3 elements
 > node tid =   0, ready time =  40
 > node tid =   7, ready time = 999
 > node tid =   6, ready time = 1000
-> printing first element of list --->> queue2, for-loop before pop
 > node tid =   1, ready time= 20

-> printing queue2, for-loop after pop, total 4 elements
 > node tid =   2, ready time =  30
 > node tid =   3, ready time =  35
 > node tid =   4, ready time =  50
 > node tid =   5, ready time =  10
-> printing queue3, for-loop, total 4 elements
 > node tid =   1, ready time =  20
 > node tid =   0, ready time =  40
 > node tid =   7, ready time = 999
 > node tid =   6, ready time = 1000
-> printing first element of list --->> queue2, for-loop before pop
 > node tid =   2, ready time= 30

-> printing queue2, for-loop after pop, total 3 elements
 > node tid =   3, ready time =  35
 > node tid =   4, ready time =  50
 > node tid =   5, ready time =  10
-> printing queue3, for-loop, total 5 elements
 > node tid =   1, ready time =  20
 > node tid =   2, ready time =  30
 > node tid =   0, ready time =  40
 > node tid =   7, ready time = 999
 > node tid =   6, ready time = 1000
-> printing first element of list --->> queue2, for-loop before pop
 > node tid =   3, ready time= 35

-> printing queue2, for-loop after pop, total 2 elements
 > node tid =   4, ready time =  50
 > node tid =   5, ready time =  10
-> printing queue3, for-loop, total 6 elements
 > node tid =   1, ready time =  20
 > node tid =   2, ready time =  30
 > node tid =   3, ready time =  35
 > node tid =   0, ready time =  40
 > node tid =   7, ready time = 999
 > node tid =   6, ready time = 1000
-> printing first element of list --->> queue2, for-loop before pop
 > node tid =   4, ready time= 50

-> printing queue2, for-loop after pop, total 1 elements
 > node tid =   5, ready time =  10
-> printing queue3, for-loop, total 7 elements
 > node tid =   1, ready time =  20
 > node tid =   2, ready time =  30
 > node tid =   3, ready time =  35
 > node tid =   0, ready time =  40
 > node tid =   4, ready time =  50
 > node tid =   7, ready time = 999
 > node tid =   6, ready time = 1000
-> printing first element of list --->> queue2, for-loop before pop
 > node tid =   5, ready time= 10

-> printing queue2, for-loop after pop, total 0 elements
-> printing queue3, for-loop, total 8 elements
 > node tid =   5, ready time =  10
 > node tid =   1, ready time =  20
 > node tid =   2, ready time =  30
 > node tid =   3, ready time =  35
 > node tid =   0, ready time =  40
 > node tid =   4, ready time =  50
 > node tid =   7, ready time = 999
 > node tid =   6, ready time = 1000
-> printing queue2, after 1. for loop, total 0 elements
-> printing queue3, after 1. for loop, total 8 elements
 > node tid =   5, ready time =  10
 > node tid =   1, ready time =  20
 > node tid =   2, ready time =  30
 > node tid =   3, ready time =  35
 > node tid =   0, ready time =  40
 > node tid =   4, ready time =  50
 > node tid =   7, ready time = 999
 > node tid =   6, ready time = 1000
-> printing queue1, after 1. for loop, total 6 elements
 > node tid =   0, ready time =  40
 > node tid =   1, ready time =  20
 > node tid =   2, ready time =  30
 > node tid =   3, ready time =  35
 > node tid =   4, ready time =  50
 > node tid =   5, ready time =  10
---------------------------------------------------------------
---------------------------------------------------------------
-> printing queue3 after 600 SortIns and 590 pops, total 16 elements
 > node tid = 591, ready time = 972
 > node tid = 592, ready time = 974
 > node tid = 593, ready time = 976
 > node tid = 594, ready time = 978
 > node tid = 595, ready time = 980
 > node tid = 596, ready time = 982
 > node tid = 597, ready time = 984
 > node tid = 598, ready time = 986
 > node tid = 599, ready time = 988
 > node tid = 600, ready time = 990
 > node tid = 601, ready time = 992
 > node tid = 602, ready time = 994
 > node tid = 603, ready time = 996
 > node tid = 604, ready time = 998
 > node tid =   7, ready time = 999
 > node tid =   6, ready time = 1000
-> printing queue2 before end, total 0 elements
-> printing queue4 before end, total 0 elements
---------------------------------------------------------------
-> printing fifo queue after copy test, total 8 elements
 > node tid = 7587744, ready time =   0
 > node tid = 7549168, ready time =   0
 > node tid = 7549728, ready time =   0
 > node tid = 7588128, ready time =   0
 > node tid = 7588064, ready time =   0
 > node tid = 7588000, ready time =   0
 > node tid = 7587936, ready time =   0
 > node tid = 7587872, ready time =   0
---------------------------------------------------------------
